#include"BinaryTree.h"

int main()
{
	//char a[] = "ABD##E#H##CF##G##";
	char a[] = "ABD##E##CF##G##";
	int i = 0;
	BTNode* root = BinaryTreeCreate(a, &i);
	BinaryTreePrevOrder(root);
	printf("\n");

	/*int Size = BinaryTreeSize(root);
	printf("%d\n", Size);

	int size = BinaryTreeLevelKSize(root, 3);
	printf("%d\n", size);

	BinaryTreeInOrder(root);
	printf("\n");

	BinaryTreePostOrder(root);
	printf("\n");

	BTNode* find = BinaryTreeFind(root, 'D');
	printf("%c\n",find->_data);

	int n = BinaryTreeLeafSize(root);
	printf("%d\n", n);

	BinaryTreeLevelOrder(root);*/

	
	int x = BinaryTreeComplete(root);
	printf("%d\n", x);

	BinaryTreeDestory(root);


	return 0;
}